A new one point quadrature rule over arbitrary star convex polygon/polyhedron
نویسندگان
چکیده
Abstract The Linear Smoothing (LS) scheme [1] ameliorates linear and quadratic approximations over convex polytopes by employing a three-point integration scheme. In this work, we propose a linearly consistent one point integration scheme which possesses the properties of the LS scheme with three integration points but requires one third of the integration computational time. The essence of the proposed technique is to approximate the strain by the smoothed nodal derivatives that are determined by the discrete form of the divergence theorem. This is done by the Taylor’s expansion of the weak form which facilitates the evaluation of the smoothed nodal derivatives acting as stabilization terms. The smoothed nodal derivatives are evaluated only at the centroid of each integration cell. These integration cells are the simplex subcells (triangle/tetrahedron in two and three dimensions) obtained by subdividing the polytope. The salient feature of the proposed technique is that it requires only n integrations for an n− sided polytope as opposed to 3n in [1] and 13n integration points in the conventional approach. The convergence properties, the accuracy, and the efficacy of the LS with one point integration scheme are discussed by solving few benchmark problems in elastostatics.
منابع مشابه
Star Unfolding Convex Polyhedra via Quasigeodesic Loops
We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron P to a simple (nonoverlapping) planar polygon: cut along one shortest path from each vertex of P to Q, and cut all but one segment of Q.
متن کاملUnfolding Convex Polyhedra via Quasigeodesic Star Unfoldings
We extend the notion of a star unfolding to be based on a simple quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron P to a simple, planar polygon: shortest paths from all vertices of P to Q are cut, and all but one segment of Q is cut.
متن کاملNATIONAL UNIVERSITY OF SINGAPORE School of Computing PH.D DEFENCE - PUBLIC SEMINAR
This thesis studies transformation between geometric structures via geometric operations that act on some simplices of a geometric structure. Such a transformation is termed local transformation as an operation utilizes only information local to some neighboring simplices but nothing about other attributes or configurations global in nature to the structure. One famous algorithm of local transf...
متن کاملPoint-in-Convex Polygon and Point-in-Convex Polyhedron Algorithms with O(1) Complexity using Space Subdivision
There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees, octrees, kd-trees, bounding volume hierarchies etc. However in some applications a non-orthogonal space subdivision can offer new ways for actual speed up. In th...
متن کاملGeneralizing Monotonicity: on Recognizing Special Classes of Polygons and Polyhedra
A simple polyhedron is weakly-monotonic in direction ~ d provided that the intersection of the polyhedron and any plane with normal ~ d is simply-connected (i.e. empty, a point, a line-segment or a simple polygon). Furthermore, if the intersection is a convex set, then the polyhedron is said to be weakly-monotonic in the convex sense. Toussaint [10] introduced these types of polyhedra as genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017